A Transient Queueing Analysis under Time-varying Arrival and Service Rates for Enabling Low-Latency Services

نویسندگان

  • Wonjun Hwang
  • Yoora Kim
  • Kyunghan Lee
چکیده

ABSTRACT Understanding the detailed queueing behavior of a networking session is critical in enabling low-latency services over the Internet. Especially when the packet arrival and service rates at the queue of a link vary over time and moreover when the session is short-lived, analyzing the corresponding queue behavior as a function of time, which involves a transient analysis, becomes extremely challenging. In this paper, we propose and develop a new analytical framework that anatomizes the transient queue behavior under time-varying arrival and service rates even under unstable conditions. Our framework is capable of answering key questions in designing low-latency services such as the time-dependent probability distribution of the queue length; the instantaneous or time-averaged violation probability that the queue length exceeds a certain threshold; and the fraction of time during an interval [0, t] at which the queue length exceeds a certain threshold. We validate our framework by comparing its prediction results over time with the statistical simulation results and con€rm that our analysis is accurate enough. Our extensive demonstrations on the ecacy of the analytical framework in designing low-latency services reveal that its prediction ability for the transient queue behavior in diverse time-varying packet arrival and service paŠerns can be of a high practical value.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of M/G/ 1 queueing model with state dependent arrival and vacation

This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...

متن کامل

Multi-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)

In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...

متن کامل

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the Mt/Mt/1 processor-sharing queue....

متن کامل

Transient Analysis of Queues for Peer-based Multimedia Content Delivery

Consider a firm that sells on-line multimedia content. In order to manage costs and quality of service, this firm maintains a peer-network whereby users download files from other peers that have downloaded them in the past. The scenario can be modeled as a queueing system where the number of servers varies over time. We develop analytical models based on fluid and diffusion approximations to an...

متن کامل

Batch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times

We analyze the latency or sojourn time L(m,n) for the last customer in a batch of n customers to exit from the m-th queue in a tandem of m queues in the setting where the queues are in equilibrium before the batch of customers arrives at the first queue. We first characterize the distribution of L(m,n) exactly for every m and n, under the assumption that the queues have unlimited buffers and th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1704.07091  شماره 

صفحات  -

تاریخ انتشار 2017